A universal planar graph under the minor relation
نویسندگان
چکیده
We construct an in nite planar graph that contains every planar graph as a minor.
منابع مشابه
Minor-universal planar graphs without accumulation points
We show that the countably infinite union of infinite grids, H say, is minor-universal in the class of all graphs that can be drawn in the plane without vertex accumulation points, i.e. that H contains every such graph as a minor. Furthermore, we characterize the graphs that occur as minors of the infinite grid by a natural topological condition on their embeddings.
متن کاملForbidding Kuratowski Graphs as Immersions
The immersion relation is a partial ordering relation on graphs that is weaker than the topological minor relation in the sense that if a graph G contains a graph H as a topological minor, then it also contains it as an immersion but not vice versa. Kuratowski graphs, namely K5 and K3,3, give a precise characterization of planar graphs when excluded as topological minors. In this note we give a...
متن کاملMinor-Minimal Planar Graphs of Even Branch-Width
Let k ≥ 1 be an integer, let H be a minor-minimal graph in the projective plane such that every homotopically non-trivial closed curve intersects H at least k times, and let G be the planar double cover of H obtained by lifting G into the universal covering space of the projective plane, the sphere. We prove that G is minor-minimal of branch-width 2k. We also exhibit examples of minor-minimal p...
متن کاملNew representation results for planar graphs
A universal representation theorem is derived that shows any graph is the intersection graph of one chordal graph, a number of co-bipartite graphs, and one unit interval graph. Central to the the result is the notion of the clique cover width which is a generalization of the bandwidth parameter. Specifically, we show that any planar graph is the intersection graph of one chordal graph, four co-...
متن کاملStack and Queue Layouts via Layered Separators
It is known that every proper minor-closed class of graphs has bounded stack-number (a.k.a. book thickness and page number). While this includes notable graph families such as planar graphs and graphs of bounded genus, many other graph families are not closed under taking minors. For fixed g and k, we show that every n-vertex graph that can be embedded on a surface of genus g with at most k cro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Graph Theory
دوره 32 شماره
صفحات -
تاریخ انتشار 1999